Calculating Kolmogorov Complexity from the Transcriptome Data
نویسندگان
چکیده
Information entropy is used to summarize transcriptome data, but ignoring zero count data contained them. Ignoring zero count data causes loss of information and sometimes it was difficult to distinguish between multiple transcriptomes. Here, we estimate Kolmogorov complexity of transcriptome treating zero count data and distinguish similar transcriptome data.
منابع مشابه
3D Scene and Object Classification Based on Information Complexity of Depth Data
In this paper the problem of 3D scene and object classification from depth data is addressed. In contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. In order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. Exploiting the algorithmic information theory, a new def...
متن کاملEvaluation of Hepatic Cystic Echinococcosis’ CT image in Xinjiang Uygur Autonomous Region based on Kolmogorov Complexity Model
Designing and developing computer-assisted image processing techniques to help doctors improve their diagnosis has received considerable interests over the past years. In this paper, we used the kolmogorov complexity model to analyze the CT images of the healthy liver and multiple daughter hydatid cysts. Before the complexity characteristic calculating, the image preprocessing methods had been ...
متن کاملFirst transcriptome analysis of Iranian scorpion, Mesobuthus eupeus venom gland
Scorpions are generally an important source of bioactive components, including toxins and other small peptides as attractive molecules for new drug development. Mesobuthus eupeus, from medically important and widely distributed Buthidae family, is the most abundant species in Iran. Researchers are interesting on the gland of this scorpion due to the complexity of its venom. Here, we have analyz...
متن کاملOn the random property of compressed data via Huffman coding
Though Huffman codes [2,3,4,5,9] have shown their power in data compression, there are still some issues that are not noticed. In the present paper, we address the issue on the random property of compressed data via Huffman coding. Randomized computation is the only known method for many notoriously difficult #P-complete problems such as permanent, and some network reliability problems, etc [1,...
متن کاملFirst transcriptome analysis of Iranian scorpion, Mesobuthus eupeus venom gland
Scorpions are generally an important source of bioactive components, including toxins and other small peptides as attractive molecules for new drug development. Mesobuthus eupeus, from medically important and widely distributed Buthidae family, is the most abundant species in Iran. Researchers are interesting on the gland of this scorpion due to the complexity of its venom. Here, we have analyz...
متن کامل